HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas
نویسنده
چکیده
Graph conditions are a means to express structural properties for graph transformation systems and graph programs in a large variety of application areas. With HR∗ graph conditions, non-local graph properties like “there exists a path of arbitrary length” or “the graph is circle-free” can be expressed. We show, by induction over the structure of formulas and conditions, that (1) any node-counting monadic second-order formula can be expressed by an HR∗ condition and (2) any HR∗ condition can be expressed by a second-order graph formula.
منابع مشابه
Monadic Second-Order Definable Graph Transductions: A Survey
Courcelle, B., Monadic second-order definable graph transductions: a survey, Theoretical Computer Science 126 (1994) 53-75. Formulas of monadic second-order logic can be used to specify graph transductions, i.e., multivalued functions from graphs to graphs. We obtain in this way classes of graph transductions, called monadic second-order definable graph transductions (or, more simply, d&able tr...
متن کاملMonadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts. We first explain the role of Logic. A graph, eith...
متن کاملExpressiveness of graph conditions with variables
Graph conditions are very important for graph transformation systems and graph programs in a large variety of application areas. Nevertheless, non-local graph properties like “there exists a path”, “the graph is connected”, and “the graph is cycle-free” are not expressible by finite graph conditions. In this paper, we generalize the notion of finite graph conditions, expressively equivalent to ...
متن کاملThe monadic second-order logic of graphs XII: planar graphs and planar maps
We prove that we can specify by formulas of monadic second-order logic the unique planar embedding of a 3-connected planar graph. If the planar graph is not 3-connected but given with a linear order of its set of edges, we can also define a planar embedding by monadic second-order formulas. We cannot do so in general without the ordering, even for 2-connected planar graphs. The planar embedding...
متن کاملThe monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation of relational structures defined by monadic second-order formulas, or equivalently, has bounded clique-width. We prove that this conjecture is true if and only if it is true for the particular cases of bipartite undirected graphs, of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 61 شماره
صفحات -
تاریخ انتشار 2013